First-order anti-intuitionistic logic with apartness
نویسندگان
چکیده
منابع مشابه
Intuitionistic Completeness of First-Order Logic
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the intended semantics of iFOL and mFOL. Our proof is intuitionistic and provides an effective procedure Prf that converts uniform minimal evidence into a formal fi...
متن کاملSpecifying Functional Programs with Intuitionistic First Order Logic
We propose a method of specifying functional programs (in a subset of Haskell) using intuitionistic first order logic, that works well for inductive datatypes, higher-order functions and parametric polymorphism.
متن کاملSequent calculus proof theory of intuitionistic apartness and order relations
Contraction-free sequent calculi for intuitionistic theories of apartness and order are given and cut-elimination for the calculi proved. Among the consequences of the result is the disjunction property for these theories. Through methods of proof analysis and permutation of rules, we establish conservativity of the theory of apartness over the theory of equality defined as the negation of apar...
متن کاملIntuitionistic Completeness of First-Order Logic – mPC Case
We constructively prove in type theory the completeness of the minimal Propositional Calculus, showing that a formula is provable in mPC if and only if it is uniformly valid in constructive type theory extended with the intersection operator. Our completeness proof provides an effective procedure Prf that converts any uniform evidence into a formal an mPC proof. Mark Bickford has implemented Pr...
متن کاملClausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, which we prove correct and complete. The calculus was implemented by extending the classical prover leanCoP. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2004
ISSN: 1425-3305
DOI: 10.12775/llp.2004.005